- arithmetical predicate
- мат.арифметический предикат
English-Russian scientific dictionary. 2008.
arithmetical predicate
Смотреть что такое "arithmetical predicate" в других словарях:
Arithmetical hierarchy — In mathematical logic, the arithmetical hierarchy, arithmetic hierarchy or Kleene hierarchy classifies certain sets based on the complexity of formulas that define them. Any set that receives a classification is called arithmetical. The… … Wikipedia
arithmetical mean — Mean Mean, n. 1. That which is mean, or intermediate, between two extremes of place, time, or number; the middle point or place; middle rate or degree; mediocrity; medium; absence of extremes or excess; moderation; measure. [1913 Webster] But to… … The Collaborative International Dictionary of English
Kleene's T predicate — In computability theory, the T predicate, first studied by mathematician Stephen Cole Kleene, is a particular set of triples of natural numbers that is used to represent computable functions within formal theories of arithmetic. Informally, the T … Wikipedia
ω-consistent theory — In mathematical logic, an ω consistent (or omega consistent, also called numerically segregative[1]) theory is a theory (collection of sentences) that is not only (syntactically) consistent (that is, does not prove a contradiction), but also… … Wikipedia
Gödel's incompleteness theorems — In mathematical logic, Gödel s incompleteness theorems, proved by Kurt Gödel in 1931, are two theorems stating inherent limitations of all but the most trivial formal systems for arithmetic of mathematical interest. The theorems are of… … Wikipedia
Ω-consistent theory — In mathematical logic, an ω consistent (or omega consistent, also called numerically segregativeW.V.O. Quine, Set Theory and its Logic ] ) theory is a theory (collection of sentences) that is not only (syntactically) consistent (that is, does not … Wikipedia
Computability theory — For the concept of computability, see Computability. Computability theory, also called recursion theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown … Wikipedia
Second-order arithmetic — In mathematical logic, second order arithmetic is a collection of axiomatic systems that formalize the natural numbers and sets thereof. It is an alternative to axiomatic set theory as a foundation for much, but not all, of mathematics. The… … Wikipedia
Function (mathematics) — f(x) redirects here. For the band, see f(x) (band). Graph of example function, In mathematics, a function associates one quantity, the a … Wikipedia
Logicism — is one of the schools of thought in the philosophy of mathematics, putting forth the theory that mathematics is an extension of logic and therefore some or all mathematics is reducible to logic.[1] Bertrand Russell and Alfred North Whitehead… … Wikipedia
Principia Mathematica — For Isaac Newton s book containing basic laws of physics, see Philosophiæ Naturalis Principia Mathematica. The title page of the shortened version of the Principia Mathematica to *56. The Principia Mathematica is a three volume work on the… … Wikipedia
